Resampling and its Avoidance in Genetic Algorithms

Genetic algorithms are widely used as optimization and adaptation tools, and they became important in artiicial intelligence. Even though several successful applications have been reported, recent research has identiied some ineeciencies in genetic algorithm performance. This paper argues that the degradation of genetic algorithm performance originates from the random application of the variation operators, since resampling of already visited points is not avoided. Consequently, this paper proposes an algorithmic framework, the \deterministic" genetic algorithm, that yields signiicantly faster convergence.